Betweenness centrality in large complex networks
نویسندگان
چکیده
منابع مشابه
Betweenness centrality in large complex networks
We analyze the betweenness centrality (BC) of nodes in large complex networks. In general, the BC is increasing with connectivity as a power law with an exponent η. We find that for trees or networks with a small loop density η = 2 while a larger density of loops leads to η < 2. For scale-free networks characterized by an exponent γ which describes the connectivity distribution decay, the BC is...
متن کاملApproximating Betweenness Centrality in Large Evolving Networks
Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For static networks, approximation based on randomly sampled paths has been shown to be significantly faster in practice. However, for dynamic networks, no approximation algorithm for betweenness centrali...
متن کاملMetropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks
Betweenness centrality is an important index widely used in different domains such as social networks, traffic networks and the world wide web. However, even for mid-size networks that have only a few hundreds thousands vertices, it is computationally expensive to compute exact betweenness scores. Therefore in recent years, several approximate algorithms have been developed. In this paper, firs...
متن کاملHierarchical Decomposition for Betweenness Centrality Measure of Complex Networks
Betweenness centrality is an indicator of a node's centrality in a network. It is equal to the number of shortest paths from all vertices to all others that pass through that node. Most of real-world large networks display a hierarchical community structure, and their betweenness computation possesses rather high complexity. Here we propose a new hierarchical decomposition approach to speed up ...
متن کاملApproximating Betweenness Centrality in Fully Dynamic Networks
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Because exact computations are prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in networks that change over ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B - Condensed Matter
سال: 2004
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2004-00111-4